Fast Generalized Bruhat Decomposition
نویسنده
چکیده
The deterministic recursive pivot-free algorithms for the computation of generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as algorithm of matrix multiplication and it is suitable for the parallel computer systems.
منابع مشابه
Generalized Bruhat Decomposition in Commutative Domains
Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.
متن کاملFast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition
The row (resp. column) rank profile of a matrix describes the stair-case shape of its row (resp. column) echelon form. We here propose a new matrix invariant, the rank profile matrix, summarizing all information on the row and column rank profiles of all the leading sub-matrices. We show that this normal form exists and is unique over any ring, provided that the notion of McCoy’s rank is used, ...
متن کاملTriangular Decomposition of Matrices in a Domain
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a generalization of LU and Bruhat decompositions, because they both may be easily obtained from this triangular decomposition. Algorithms have the same complexity a...
متن کاملTime and space efficient generators for quasiseparable matrices
The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in solving PDE’s for particle interaction with the Fast Multi-pole Method (FMM), or computing generalized eigenvalues. From these application fields, structured repr...
متن کاملNoncommutative Double Bruhat Cells and Their Factorizations
0. Introduction 1 1. Quasideterminants and Quasiminors 3 1.1. Definition of quasideterminants 3 1.2. Elementary properties of quasideterminants 4 1.3. Noncommutative Sylvester formula 5 1.4. Quasi-Plücker coordinates and Gauss LDU -factorization 5 1.5. Positive quasiminors 6 2. Basic factorizations in GLn(F) 7 3. Examples 11 3.1. A factorization in the Borel subgroup of GL3(F) 11 3.2. A factori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010